Search results for "Parallel algorithm"
showing 10 items of 32 documents
High quality conservative surface mesh generation for swept volumes
2012
We present a novel, efficient and flexible scheme to generate a high quality mesh that approximates the outer boundary of a swept volume. Our approach comes with two guarantees. First, the approximation is conservative, i.e., the swept volume is enclosed by the generated mesh. Second, the one-sided Hausdorff distance of the generated mesh to the swept volume is upper bounded by a user defined tolerance. Exploiting this tolerance the algorithm generates a mesh that is adapted to the local complexity of the swept volume boundary, keeping the overall output complexity remarkably low. The algorithm is two-phased: the actual sweep and the mesh generation. In the sweeping phase we introduce a gen…
Parallel algorithms for large-scale biological sequence alignment on Xeon-Phi based clusters
2016
Computing alignments between two or more sequences are common operations frequently performed in computational molecular biology. The continuing growth of biological sequence databases establishes the need for their efficient parallel implementation on modern accelerators. This paper presents new approaches to high performance biological sequence database scanning with the Smith-Waterman algorithm and the first stage of progressive multiple sequence alignment based on the ClustalW heuristic on a Xeon Phi-based compute cluster. Our approach uses a three-level parallelization scheme to take full advantage of the compute power available on this type of architecture; i.e. cluster-level data par…
Local symmetries of digital contours from their chain codes
1996
In this work symmetry is evaluated as a numeric feature for each point of a contour, using only the positions of a local vicinity of points. A measurement is defined, named as Local Symmetric Deficiency (LSD), so that the lower this quantity is, the higher the symmetry will be in the local region considered. This approach is very simple and it is based on a suitable manipulation of the chain code of the curve. Its computational cost is very low and it has the advantages of a parallel algorithm, since values for LSD can be computed for each point independently.
Individual Variability and Average Reliability in Parallel Networks of Heterogeneous Biological and Artificial Nanostructures
2013
We simulate the collective electrical response of heterogeneous ensembles of biological and artificial nanostructures whose individual threshold potentials show a significant variability. This problem is of current interest because nanotechnology is bound to produce nanostructures with a significant experimental variability in their individual physical properties. This diversity is also present in biological systems that are however able to process information efficiently. The nanostructures considered are the ion channels of biological membranes, nanowire field-effect transistors, and metallic nanoparticle-based single electron transistors. These systems are simulated with canonical models…
A simple algorithm to evaluate the local symmetry at each point of a closed contour
1995
In this work, contour symmetry is evaluated as a numeric feature for each point of the shape outline, using only the positions of a local vicinity of points. A measure is defined, named Local Symmetric Deficiency (LSD), so that the lower this quantity is, the higher the symmetry will be in the local region considered. This approach is simpler than related previous ones both from a conceptual point of view and for its implementation, since it is reduced just to a suitable manipulation of the Freeman chain code of the curve studied. Its computational cost is very low and it has the advantages of a parallel algorithm, since values for LSD can be computed for each point independently.
SAUCE: A web application for interactive teaching and learning of parallel programming
2017
Abstract Prevalent hardware trends towards parallel architectures and algorithms create a growing demand for graduate students familiar with the programming of concurrent software. However, learning parallel programming is challenging due to complex communication and memory access patterns as well as the avoidance of common pitfalls such as dead-locks and race conditions. Hence, the learning process has to be supported by adequate software solutions in order to enable future computer scientists and engineers to write robust and efficient code. This paper discusses a selection of well-known parallel algorithms based on C++11 threads, OpenMP, MPI, and CUDA that can be interactively embedded i…
Two Parallel Algorithms for the Analysis of Random Images
1988
Aim of the paper is to show a computational paradigm, that reduces some algorithms on undirected graphs into image analysis algorithms. In particular two parallel algorithms on undirected weighted graphs, often used in the analysis of sparse images, are described.
Tuning a Mamdani Fuzzy Controller with an Imperialist Competitive Algorithm
2021
We have implemented a fuzzy controller with a view to regulating a single-input and single-output second-order linear system. The fuzzy controller was a Mamdami proportional-derivative controller. To determine the parameters of the fuzzy controller we have used an imperialist competitive algorithm. This type of algorithm has a long running time so we implemented also a parallel version of the algorithm that we run on HPC Zamolxes located at the Engineering Faculty of “Lucian Blaga” University from Sibiu. Because we did not have on this computer a version of MATLAB allowing to write parallel algorithms, we implemented the entire application in the C language using the MPI library.
Parallel implementation on DSPs of a face detection algorithm
2002
In order to localize the face in an image, our approach consists of approximating the face oval shape with an ellipse and to compute coordinates of the center of the ellipse. For this purpose, we explore a new version of the Hough transformation: the fuzzy generalized Hough transformation. To reduce the computation time, we present also a parallel implementation of the algorithm on 2 digital signal processors and we show that an acceleration of a factor of 1.62 has been obtained.
Numerical experiments with a parallel fast direct elliptic solver on Cray T3E
1997
A parallel fast direct O(N log N) solver is shortly described for linear systems with separable block tridiagonal matrices. A good parallel scalability of the proposed method is demonstrated on a Cray T3E parallel computer using MPI in communication. Also, the sequential performance is compared with the well-known BLKTRI-implementation of the generalized. cyclic reduction method using a single processor of Cray T3E.